${\mit \Lambda }^+_c \rightarrow p \mu ^+\mu ^-$ Results from LHCb
نویسندگان
چکیده
منابع مشابه
Superdeduction in Lambda-Bar-Mu-Mu-Tilde
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for superdeduction, both based on Christian Urban’s work on classical sequent calculus. However the compu...
متن کاملLambda and mu-symmetries
Symmetry analysis is a standard and powerful method in the analysis of differential equations, and in the determination of explicit solutions of nonlinear ones. It was remarked by Muriel and Romero [10] (see also the work by Pucci and Saccomandi [14]) that for ODEs the notion of symmetry can be somehow relaxed to that of lambda-symmetry (see below), still retaining the relevant properties for s...
متن کاملExpressibility in the Lambda Calculus with Mu
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite λ-terms that are λletrec-expressible in the sense that they arise as infinite unfoldings of terms in λletrec, the λ-calculus with letrec. We provide two characterizations, using concepts we introduce for infinite λ-terms: regularity, strong regularity, ...
متن کاملExplicit Substitutions for the Lambda � Mu Calculus �
We present a con uent rewrite system which extents a previous calculus of explicit substitu tions for the lambda calculus HaLe to Parigot s untyped lambda mu calculus Par This extension embeds the lambda mu calculus as a sub theory and provides the basis for a theoretical framework to study the abstract properties of implementations of functional pro gramming languages enriched with control str...
متن کاملSound and Complete Typing for lambda-mu
In this paper we define intersection and union type assignment for Parigot's calculus λµ. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Polonica B
سال: 2019
ISSN: 0587-4254,1509-5770
DOI: 10.5506/aphyspolb.50.1041